A Power Schur Complement Low-Rank Correction Preconditioner for General Sparse Linear Systems
نویسندگان
چکیده
A parallel preconditioner is proposed for general large sparse linear systems that combines a power series expansion method with low-rank correction techniques. To enhance convergence, seri...
منابع مشابه
A Hierarchical Low-rank Schur Complement Preconditioner for Indefinite Linear Systems
Nonsymmetric and highly indefinite linear systems can be quite difficult to solve via iterative methods. This paper combines ideas from the Multilevel Schur Low-Rank preconditioner developed by Y. Xi, R. Li, and Y. Saad [SIAM J. Matrix Anal., 37 (2016), pp. 235–259] with classic block preconditioning strategies in order to handle this case. The method to be described generates a tree structure ...
متن کامل1 Schur complement preconditioners for distributed general sparse linear systems ?
This paper discusses the Schur complement viewpoint when developing parallel preconditioners for general sparse linear systems. Schur complement methods are pervasive in numerical linear algebra where they represent a canonical way of implementing divide-and-conquer principles. The goal of this note is to give a brief overview of recent progress made in using these techniques for solving genera...
متن کاملDistributed Schur Complement Techniques for General Sparse Linear Systems
This paper presents a few preconditioning techniques for solving general sparse linear systems on distributed memory environments. These techniques utilize the Schur complement system for deriving the preconditioning matrix in a number of ways. Two of these pre-conditioners consist of an approximate solution process for the global system, which exploit approximate LU factorizations for diagonal...
متن کاملA Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
We introduce some cheaper and faster variants of the classical additive Schwarz preconditioner (AS) for general sparse linear systems and show, by numerical examples, that the new methods are superior to AS in terms of both iteration counts and CPU time, as well as the communication cost when implemented on distributed memory computers. This is especially true for harder problems such as indefi...
متن کاملA preconditioner for the Schur complement matrix
A preconditioner for iterative solution of the interface problem in Schur Complement Domain Decomposition Methods is presented. This preconditioner is based on solving a problem in a narrow strip around the interface. It requires much less memory and computing time than classical Neumann-Neumann preconditioner and its variants, and handles correctly the flux splitting among subdomains that shar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2021
ISSN: ['1095-7162', '0895-4798']
DOI: https://doi.org/10.1137/20m1316445